package anthology.daily_question._25_02;
//https://leetcode.cn/problems/range-addition-ii/description/?envType=daily-question&envId=2025-02-02
public class _0598区间加法2 {
    class Solution {
        public int maxCount(int m, int n, int[][] ops) {
            int mina = m, minb = n;
            for (int[] op : ops) {
                mina = Math.min(mina, op[0]);
                minb = Math.min(minb, op[1]);
            }
            return mina * minb;
        }
    }
}
